Signum Contradictions

Signum Equations and Extremal Coefficients

SIGNUM: A Graph Algorithm for Terminology Extraction

Terminology extraction is an essential step in several fields of natural language processing such as dictionary and ontology extraction. In this paper, we present a novel graph-based approach to terminology extraction. We use SIGNUM, a general purpose graph-based algorithm for binary clustering on directed weighted graphs generated using a metric for multi-word extraction. Our approach is total...

The Signum Equation for Erdős-surányi Sequences

For an Erdős-Surányi sequence it is customary to consider its signum equation. Based on some classical heuristic arguments, we conjecture the asymptotic behavior for the number of solutions of this signum equation in the case of the sequence {n}n (k 2) and the sequence of primes. Surprisingly, we show that this method does not apply at all for the Fibonacci sequence. By computing the precise nu...

Structural Contradictions

We study the relation between logical contradictions such as p ∧ ¬p and structural contradictions such as p∩ (p · q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish ...

Correcting Contradictions

This paper describes a manual investigation of the contradiction asymmetries of the SICK corpus, which is the intended testing set for a new system for natural language inference. Any system providing conceptual semantics for sentences, so that entailment-contradiction-neutrality relations between sentences can be identified, needs a baseline test set. The investigation of this test set, a part...